Broadening the Scope of SMT-COMP: the Application Track

نویسندگان

  • Roberto Bruttomesso
  • Alberto Griggio
چکیده

During the last decade, SMT solvers have seen impressive improvements in performance, features and popularity, and nowadays they are routinely applied as reasoning engines in several domains. The annual SMT solvers competition, SMT-COMP, has been one of the main factors contributing to this success since its first edition in 2005. In order to maintain its significance and positive impact, SMT-COMP needs to evolve to capture the many different novel requirements which applications pose to SMT solvers, which often go beyond a single yes/no answer to a satisfiability check. In this paper, we present a first step in this direction: the “Application” track introduced in SMT-COMP 2011. We present its design and implementation, report and discuss the results of its first edition, and highlight its features and current limitations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evidence-Informed Deliberative Processes for Universal Health Coverage: Broadening the Scope; Comment on “Priority Setting for Universal Health Coverage: We Need Evidence-Informed Deliberative Processes, Not Just More Evidence on Cost-Effectiveness”

Universal health coverage (UHC) is high on the global health agenda, and priority setting is fundamental to the fair and efficient pursuit of this goal. In a recent editorial, Rob Baltussen and colleagues point to the need to go beyond evidence on cost-effectiveness and call for evidence-informed deliberative processes when setting priorities for UHC. Such processes are crucial at every step on...

متن کامل

Results and Analysis of SyGuS-Comp'15

Syntax-Guided Synthesis (SyGuS) is the computational problem of finding an implementation f that meets both a semantic constraint given by a logical formula φ in a background theory T , and a syntactic constraint given by a grammar G, which specifies the allowed set of candidate implementations. Such a synthesis problem can be formally defined in SyGuS-IF, a language that is built on top of SMT...

متن کامل

Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)

The Satisfiability Modulo Theories Competition (SMT-COMP) arose from the SMT-LIB initiative to spur adoption of common, community-designed formats, and to spark further advances in satisfiability modulo theories (SMT). The first SMT-COMP was held in 2005 as a satellite event of CAV 2005. SMT-COMP 2006 was held August 17 19, 2006, as a satellite event of CAV 2006. This paper describes the rules ...

متن کامل

A Study to Predict the Development of Wear for the Wheel/interface of a Railway Track

The train transport is often confronted with greatly repeated changes in scope, vehicle travel well-being and transport safety because of the adjustments of wheel and rail profiles. These problems are frustrating and threatening. Thus, there is a requirement for an approach to predicting the wear of wheel/rail to tackle these problems. A new theoretical ground is broken through the build-up a m...

متن کامل

Design and Results of the 3rd Annual Satisfiability Modulo Theories Competition (SMT-Comp 2007)

The Satisfiability Modulo Theories Competition (SMT-COMP) is an annual competition aimed at stimulating the advance of the state-of-the-art techniques and tools developed by the Satisfiability Modulo Theories (SMT) community. As with the first two editions, SMT-COMP 2007 was held as a satellite event of CAV 2007, held July 3-7, 2007. This paper gives an overview of the rules, competition format...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012